- Notifications
You must be signed in to change notification settings - Fork 5.8k
/
Copy path349. Intersection of Two Arrays_test.go
69 lines (55 loc) · 1.07 KB
/
349. Intersection of Two Arrays_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
package leetcode
import (
"fmt"
"testing"
)
typequestion349struct {
para349
ans349
}
// para 是参数
// one 代表第一个参数
typepara349struct {
one []int
another []int
}
// ans 是答案
// one 代表第一个答案
typeans349struct {
one []int
}
funcTest_Problem349(t*testing.T) {
qs:= []question349{
{
para349{[]int{}, []int{}},
ans349{[]int{}},
},
{
para349{[]int{1}, []int{1}},
ans349{[]int{1}},
},
{
para349{[]int{1, 2, 3, 4}, []int{1, 2, 3, 4}},
ans349{[]int{1, 2, 3, 4}},
},
{
para349{[]int{1, 2, 2, 1}, []int{2, 2}},
ans349{[]int{2}},
},
{
para349{[]int{1}, []int{9, 9, 9, 9, 9}},
ans349{[]int{}},
},
{
para349{[]int{4, 9, 5}, []int{9, 4, 9, 8, 4}},
ans349{[]int{9, 4}},
},
// 如需多个测试,可以复制上方元素。
}
fmt.Printf("------------------------Leetcode Problem 349------------------------\n")
for_, q:=rangeqs {
_, p:=q.ans349, q.para349
fmt.Printf("【input】:%v 【output】:%v\n", p, intersection(p.one, p.another))
}
fmt.Printf("\n\n\n")
}